Finite-size effects in Barabási-Albert growing networks.

نویسندگان

  • B Waclaw
  • I M Sokolov
چکیده

We investigate the influence of the network's size on the degree distribution pi k in Barabási-Albert model of growing network with initial attractiveness. Our approach based on moments of pi k allows us to treat analytically several variants of the model and to calculate the cutoff function, giving finite-size corrections to pi k. We study the effect of initial configuration as well as of addition of more than one link per time step. The results indicate that asymptotic properties of the cutoff depend only on the exponent gamma in the power-law describing the tail of the degree distribution. The method presented in this paper is very general and can be applied to other growing networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

S-curve networks and an approximate method for estimating degree distributions of complex networks

In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (Logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference...

متن کامل

6 Potts model with q states on directed Barabási - Albert networks

On directed Barabási-Albert networks with two and seven neighbours selected by each added site, the Ising model with spin S = 1/2 was seen not to show a spontaneous magnetisation. Instead, the decay time for flipping of the magnetisation followed an Arrhenius law for Metropolis and Glauber algorithms, but for Wolff cluster flipping the magnetisation decayed exponentially with time. However, on ...

متن کامل

On merging and dividing of Barabási-Albert-graphs

The Barabási-Albert-model is commonly used to generate scale-free graphs, like social networks. To generate dynamics in these networks, methods for altering such graphs are needed. Growing and shrinking is done simply by doing further generation iterations or undo them. In our paper we present four methods to merge two graphs based on the Barabási-Albertmodel, and five strategies to reverse the...

متن کامل

Rare regions of the susceptible-infected-susceptible model on Barabási-Albert networks.

I extend a previous work to susceptible-infected-susceptible (SIS) models on weighted Barabási-Albert scale-free networks. Numerical evidence is provided that phases with slow, power-law dynamics emerge as the consequence of quenched disorder and tree topologies studied previously with the contact process. I compare simulation results with spectral analysis of the networks and show that the que...

متن کامل

2 4 M ay 2 00 5 Ising model simulation in directed lattices and networks

On directed lattices, with half as many neighbours as in the usual undirected lattices, the Ising model does not seem to show a spontaneous mag-netisation, at least for lower dimensions. Instead, the decay time for flipping of the magnetisation follows an Arrhenius law on the square and simple cubic lattice. On directed Barabási-Albert networks with two and seven neighbours selected by each add...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 75 5 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2007